Algorithms for Modal μ-Calculus Interpretation

Modal μ-calculus is a logic that uses min and max fixed point operators (μ, ν). It is very applicable for use in model checking, a promising domain for development, both theoretically and practically. In this essay modal μ-calculus will be defined and several interpretation algorithms will be presented. Some of the algorithms are more or less intuitive, while others involve automata theory and are more sophisticated. The algorithms, as well as the definitions, will be presented and illustrated using examples and a sketch of the proof of their correctness.